Semirecursive Sets and Positive Reducibility
نویسنده
چکیده
منابع مشابه
Reducibilities in L Rafr 1 Recursive Function Theory
REDUCIBILITIES IN RECURSIVE FUNCTION THEORY Carl Groos Jockusch, Jr. Submitted to the Department of Mathematics on May 13, 1966 in partial fulfillment of the requirements for the degree of Doctor of Philosophy. In this dissertation some reducibilities of recursive function theory are analyzed, with particular emphasis on the relationships between many-one reducibility and various kinds of truth...
متن کاملWeakly Semirecursive Sets and r.e. Orderings
Kummer, M. and F. Stephan, Weakly semirecursive sets and r.e. orderings, Annals of Pure and Applied Logic 60 (1993) 133-150. Weakly semirecursive sets have been introduced by Jockusch and Owings (1990). In the present paper their investigation is pushed forward by utilizing r.e. partial orderings, which turn out to be instrumental for the study of degrees of subclasses of weakly semirecursive s...
متن کاملOn The Structures Inside Truth-Table Degrees
The following theorems on the structure inside nonrecursive truth-table degrees are established: D egtev's result that the number of bounded truth-table degrees inside a truth-table degree is at least two is improved by showing that this number is innnite. There are even innnite chains and an-tichains of bounded truth-table degrees inside the truth-table degrees which implies an aarmative answe...
متن کاملConstructing Minimal Pairs of Degrees
We prove that there exist sets of natural numbers A and B such that A and B form a minimal pair with respect to Turing reducibility, enumeration reducibility, hyperarithmetical reducibility and hyperenumer-ation reducibility. Relativized versions of this result are presented as well. 1. Introduction In the present paper we consider four kinds of reducibilities among sets of natural numbers: Tur...
متن کاملOn the Symmetric Enumeration Degrees
A set A is symmetric enumeration (se-) reducible to a set B (A≤seB) if A is enumeration reducible to B and A is enumeration reducible to B. This reducibility gives rise to a degree structure (Dse) whose least element is the class of computable sets. We give a classification of ≤se in terms of other standard reducibilities and we show that the natural embedding of the Turing degrees (DT) into th...
متن کامل